/*
Divide Two Integers

Divide two integers without using multiplication, division and mod operator.

If it is overflow, return MAX_INT.
*/

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
//#include <math>
#include <stack>
#include <queue>
#include <fstream>
#include <sstream>
#include <unordered_set>
#include <unordered_map>
#include "print.h"
using namespace std;

/**
* Definition for binary tree*/
typedef __int32 uint32_t;


void testForStack()
{
	stack<int> mystack;
	mystack.push(10);
	mystack.push(20);
	mystack.top() -= 5;
	cout << "mystack.top() is now " << mystack.top() << endl;
}

void testForIntToString()
{
	int a = 10;
	stringstream ss;
	ss << a;
	string str = ss.str();
	cout << str << endl;

	string str1 = to_string(a);

}
/*

alpMap[1] = "A";
alpMap[2] = "B";
alpMap[3] = "C";
alpMap[4] = "D";
alpMap[5] = "E";
alpMap[6] = "F";
alpMap[7] = "G";
alpMap[8] = "H";
alpMap[9] = "I";
alpMap[10] = "J";
alpMap[11] = "K";
alpMap[12] = "L";
alpMap[13] = "M";
alpMap[14] = "N";
alpMap[15] = "O";
alpMap[16] = "P";
alpMap[17] = "Q";
alpMap[18] = "R";
alpMap[19] = "S";
alpMap[20] = "T";
alpMap[21] = "U";
alpMap[22] = "V";
alpMap[23] = "W";
alpMap[24] = "X";
alpMap[25] = "Y";
alpMap[26] = "Z";
*/

class Solution {
public:
	int sign(int left)
	{
		return left<0 ? -1 : 1;
	}

	int divide(int dividend, int divisor) {
		
		int flag1 = sign(dividend);
		int flag2 = sign(divisor);

		long long divid = abs(static_cast<long long>(dividend));
		long long divis = abs(static_cast<long long>(divisor));

		long long result = 0;
		while (divid>=divis)
		{
			long long base = divis;

			for (int i = 0; divid>=base; ++i)
			{
				divid -= base;
				base <<= 1;
				result += 1LL << i;
			}
		}

		

		int res = static_cast<int>(result);
		if (flag1 != flag2)
		{
			if (-result <INT_MIN)
			{
				return INT_MAX;
			}
			return -res;
		}
		else
		{

			if (result > INT_MAX)
			{
				return INT_MAX;
			}
			return res;
		}
		

		
		
	}
};

int main(int argc, char* argv[])
{

	//string str1;
	int a;
	ListNode *head = new ListNode(-1);
	ListNode *p;
	p = head;
	for (int i = 1; i < argc; i++){


		cout << argv[i] << endl;

		a = atoi(argv[i]);
		//ListNode *item = new ListNode(a);
		//p->next = item;
		//p = p->next;

	}

	int dividend = 10, divisor = 1;

	//head = head->next;
	Solution s;

	cout << s.divide(dividend, divisor) << endl;

	//head = s.swapPairs(head);
	//string str2 = "23";
	//	char a = str2[2];
	//char one = '1';
	//int num = str2[1] - '0';

	//string str3 = str2 + str2[1];
	//cout << num << endl;

	//Solution s;
	//vector<string> vecStr;
	//vecStr = s.generateParenthesis(a);

	//stackTree.push(p->left);
	//stackTree.push(p->right);

	//ListNode *headA = new ListNode(1);
	//ListNode *pa1 = new ListNode(2);
	//ListNode *pa2 = new ListNode(3);
	//headA->next = pa1;
	//pa1->next = pa2;

	//ListNode *headB = new ListNode(4);
	//ListNode *pa1 = new ListNode(2);
	//ListNode *pa2 = new ListNode(3);
	//headA->next = pa1;
	//pa1->next = pa2;







	system("pause");
	return 0;
}